Abstractions for Oversubscription Planning

نویسندگان

  • Vitaly Mirkis
  • Carmel Domshlak
چکیده

ions for Oversubscription Planning Vitaly Mirkis and Carmel Domshlak Technion Israel Institute of Technology Haifa, Israel {dcarmel,mirkis}@tx.technion.ac.il

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations

While in classical planning the objective is to achieve one of the equally attractive goal states at as low total action cost as possible, the objective in deterministic oversubscription planning (OSP) is to achieve an as valuable as possible subset of goals within a fixed allowance of the total action cost. Although numerous applications in various fields share the latter objective, no substan...

متن کامل

Oversubscription Planning: Complexity and Compilability

Many real-world planning problems are oversubscription problems where all goals are not simultaneously achievable and the planner needs to find a feasible subset. We present complexity results for the so-called partial satisfaction and net benefit problems under various restrictions; this extends previous work by van den Briel et al. Our results reveal strong connections between these problems ...

متن کامل

In Search of Tractability for Partial Satisfaction Planning

The objective of partial satisfaction planning is to achieve an as valuable as possible state, tacking into account the cost of its achievement. In this work we investigate the computational complexity of restricted fragments of two variants of partial satisfaction: net-benefit and oversubscription planning. In particular, we examine restrictions on the causal graph structure and variable domai...

متن کامل

Using linear programming to solve clustered oversubscription planning problems for designing e-courses

The automatic generation of individualized plans in specific domains is an open problem that combines aspects related to automated planning, machine learning or recommendation systems technology. In this paper, we focus on a specific instance of that task; that of generating e-learning courses adapted to students’ profiles, within the automated planning paradigm. One of the open problems in thi...

متن کامل

Solving Clustered Oversubscription Problems for Planning e-Courses

In a general setting, oversubscription in planning can be posed as: given a set of goals, each one with a utility, obtain a plan that achieves some (or all) the goals, maximizing the utility, as well as minimizing the cost of achieving those goals. In this paper, we present an application domain, automatic generation of e-learning courses design, that shows a variation of the oversubscription p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013